package com.mzy.linear_struct.subject;

/**
 * @Author: codermzy
 * @Date: 2024/05/03/上午12:25
 * @Description:
 */
public class 无重复字符的最长子串3 {

    public static int lengthOfLongestSubstring(String s) {
        int start = 0;
        int end = 0;
        int left = 0;
        int len = 0;
        //       i
        // abcabcbb
        //   s
        //   e
        for (int i = 0; i < s.length(); i++) {

            if (s.charAt(start) == s.charAt(i)) {
                start++;
                len++;
                continue;
            }
            left = start;
            end++;

        }

        return 0;
    }

    public static void main(String[] args) {

    }
}
